
<!DOCTYPE HTML>
<html lang="" >
    <head>
        <meta charset="UTF-8">
        <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
        <title>广义表 · GitBook</title>
        <meta http-equiv="X-UA-Compatible" content="IE=edge" />
        <meta name="description" content="">
        <meta name="generator" content="GitBook 3.2.3">
        
        
        
    
    <link rel="stylesheet" href="../gitbook/style.css">

    
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-highlight/website.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-search/search.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-fontsettings/website.css">
                
            
        

    

    
        
    
        
    
        
    
        
    
        
    
        
    

        
    
    
    <meta name="HandheldFriendly" content="true"/>
    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
    <meta name="apple-mobile-web-app-capable" content="yes">
    <meta name="apple-mobile-web-app-status-bar-style" content="black">
    <link rel="apple-touch-icon-precomposed" sizes="152x152" href="../gitbook/images/apple-touch-icon-precomposed-152.png">
    <link rel="shortcut icon" href="../gitbook/images/favicon.ico" type="image/x-icon">

    
    
    <link rel="prev" href="矩阵的压缩存储.html" />
    

    </head>
    <body>
        
<div class="book">
    <div class="book-summary">
        
            
<div id="book-search-input" role="search">
    <input type="text" placeholder="Type to search" />
</div>

            
                <nav role="navigation">
                


<ul class="summary">
    
    

    

    
        
        
    
        <li class="chapter " data-level="1.1" data-path="../">
            
                <a href="../">
            
                    
                    数据结构（C语言版） 复习总结
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.2" data-path="../chapter1.html">
            
                <a href="../chapter1.html">
            
                    
                    第一章 绪论
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3" data-path="../chapter2/chapter2.html">
            
                <a href="../chapter2/chapter2.html">
            
                    
                    第二章 线性表
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.3.1" data-path="../chapter2/顺序表.html">
            
                <a href="../chapter2/顺序表.html">
            
                    
                    线性表的顺序表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3.2" data-path="../chapter2/链表.html">
            
                <a href="../chapter2/链表.html">
            
                    
                    线性表的链式表示和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.4" data-path="../chapter3/chapter3.html">
            
                <a href="../chapter3/chapter3.html">
            
                    
                    第三章 栈和队列
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.4.1" data-path="../chapter3/栈.html">
            
                <a href="../chapter3/栈.html">
            
                    
                    抽象数据类型栈的定义和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.4.2" data-path="../chapter3/队列.html">
            
                <a href="../chapter3/队列.html">
            
                    
                    抽象数据类型队列的定义和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.5" >
            
                <span>
            
                    
                    第四章 串
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.5.1" data-path="../chapter4/串类型.html">
            
                <a href="../chapter4/串类型.html">
            
                    
                    串类型的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.2" data-path="../chapter4/串的表示和实现.html">
            
                <a href="../chapter4/串的表示和实现.html">
            
                    
                    串的表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.3" data-path="../chapter4/串的模式匹配算法.html">
            
                <a href="../chapter4/串的模式匹配算法.html">
            
                    
                    串的模式匹配算法
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.6" >
            
                <span>
            
                    
                    第五章 数组和广义表
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.6.1" data-path="数组的定义.html">
            
                <a href="数组的定义.html">
            
                    
                    数组的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.2" data-path="矩阵的压缩存储.html">
            
                <a href="矩阵的压缩存储.html">
            
                    
                    矩阵的压缩存储
            
                </a>
            

            
        </li>
    
        <li class="chapter active" data-level="1.6.3" data-path="广义表.html">
            
                <a href="广义表.html">
            
                    
                    广义表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7" >
            
                <span>
            
                    
                    第六章 树和二叉树
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.1" data-path="../chapter6/树.html">
            
                <a href="../chapter6/树.html">
            
                    
                    树的定义与基本术语
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.2" data-path="../chapter6/二叉树.html">
            
                <a href="../chapter6/二叉树.html">
            
                    
                    二叉树
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.2.1" data-path="../chapter6/二叉树的二叉链表实现.html">
            
                <a href="../chapter6/二叉树的二叉链表实现.html">
            
                    
                    二叉树的二叉链表实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7.3" data-path="../chapter6/遍历二叉树和线索二叉树.html">
            
                <a href="../chapter6/遍历二叉树和线索二叉树.html">
            
                    
                    遍历二叉树和线索二叉树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.4" data-path="../chapter6/树和森林.html">
            
                <a href="../chapter6/树和森林.html">
            
                    
                    树和森林
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.5" data-path="../chapter6/赫夫曼树.html">
            
                <a href="../chapter6/赫夫曼树.html">
            
                    
                    赫夫曼树
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.8" >
            
                <span>
            
                    
                    第七章 图
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.8.1" data-path="../chapter7/图.html">
            
                <a href="../chapter7/图.html">
            
                    
                    图的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.2" data-path="../chapter7/图的存储结构.html">
            
                <a href="../chapter7/图的存储结构.html">
            
                    
                    图的存储结构
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.3" data-path="../chapter7/图的遍历.html">
            
                <a href="../chapter7/图的遍历.html">
            
                    
                    图的遍历
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.4" data-path="../chapter7/最小生成树.html">
            
                <a href="../chapter7/最小生成树.html">
            
                    
                    最小生成树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.5" data-path="../chapter7/有向无环图.html">
            
                <a href="../chapter7/有向无环图.html">
            
                    
                    有向无环图的应用
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.9" data-path="../chapter8/查找.html">
            
                <a href="../chapter8/查找.html">
            
                    
                    第八章 查找
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.9.1" data-path="../chapter8/静态查找表.html">
            
                <a href="../chapter8/静态查找表.html">
            
                    
                    静态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.2" data-path="../chapter8/动态查找表.html">
            
                <a href="../chapter8/动态查找表.html">
            
                    
                    动态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.3" data-path="../chapter8/哈希表.html">
            
                <a href="../chapter8/哈希表.html">
            
                    
                    哈希表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.10" data-path="../chapter9/内部排序.html">
            
                <a href="../chapter9/内部排序.html">
            
                    
                    第九章 内部排序
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.10.1" data-path="../chapter9/插入排序.html">
            
                <a href="../chapter9/插入排序.html">
            
                    
                    插入排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.2" data-path="../chapter9/选择排序.html">
            
                <a href="../chapter9/选择排序.html">
            
                    
                    选择排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.3" data-path="../chapter9/快速排序.html">
            
                <a href="../chapter9/快速排序.html">
            
                    
                    快速排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.4" data-path="../chapter9/归并排序和基数排序.html">
            
                <a href="../chapter9/归并排序和基数排序.html">
            
                    
                    归并排序和基数排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.5" data-path="../chapter9/排序方法的比较.html">
            
                <a href="../chapter9/排序方法的比较.html">
            
                    
                    排序方法的比较
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    

    

    <li class="divider"></li>

    <li>
        <a href="https://www.gitbook.com" target="blank" class="gitbook-link">
            Published with GitBook
        </a>
    </li>
</ul>


                </nav>
            
        
    </div>

    <div class="book-body">
        
            <div class="body-inner">
                
                    

<div class="book-header" role="navigation">
    

    <!-- Title -->
    <h1>
        <i class="fa fa-circle-o-notch fa-spin"></i>
        <a href=".." >广义表</a>
    </h1>
</div>




                    <div class="page-wrapper" tabindex="-1" role="main">
                        <div class="page-inner">
                            
<div id="book-search-results">
    <div class="search-noresults">
    
                                <section class="normal markdown-section">
                                
                                <h2 id="&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x5B9A;&#x4E49;">&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x5B9A;&#x4E49;</h2>
<p><strong>&#x5E7F;&#x4E49;&#x8868;</strong>&#x662F;&#x7EBF;&#x6027;&#x8868;&#x7684;&#x63A8;&#x5E7F;&#xFF0C;&#x4E5F;&#x79F0;&#x4E3A;&#x5217;&#x8868;&#xFF08;lists&#xFF09;&#x3002;&#x5E7F;&#x4E49;&#x8868;&#x4E00;&#x822C;&#x8BB0;&#x4F5C;</p>
<center><img src="&#x5E7F;&#x4E49;&#x8868;.png"></center>

<p>&#x5176;&#x4E2D;&#xFF0C;<em>LS</em> &#x662F;&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x540D;&#x79F0;&#xFF0C;<em>n</em> &#x662F;&#x5B83;&#x7684;&#x957F;&#x5EA6;&#x3002;&#x5728;&#x5E7F;&#x4E49;&#x8868;&#x4E2D; <em>a<sub>i</sub>(1&lt;=i&lt;=n)</em> &#x53EF;&#x4EE5;&#x662F;&#x5355;&#x4E2A;&#x5143;&#x7D20;&#xFF0C;&#x4E5F;&#x53EF;&#x4EE5;&#x662F;&#x5E7F;&#x4E49;&#x8868;&#xFF0C;&#x5206;&#x522B;&#x79F0;&#x4E3A;&#x5E7F;&#x4E49;&#x8868; <em>LS</em> &#x7684;<strong>&#x539F;&#x5B50;</strong>&#x548C;<strong>&#x5B50;&#x8868;</strong>&#x3002;&#x5F53;&#x5E7F;&#x4E49;&#x8868; <em>LS</em> &#x975E;&#x7A7A;&#x65F6;&#xFF0C;&#x79F0;&#x7B2C;&#x4E00;&#x4E2A;&#x5143;&#x7D20; <em>a<sub>1</sub></em> &#x4E3A; <em>LS</em> &#x7684;<strong>&#x8868;&#x5934;</strong>&#xFF08;Head&#xFF09;&#xFF0C;&#x79F0;&#x5176;&#x4F59;&#x5143;&#x7D20;&#x7EC4;&#x6210;&#x7684;&#x8868;&#x662F; <em>LS</em> &#x7684;<strong>&#x8868;&#x5C3E;</strong>&#xFF08;Tail&#xFF09;&#x3002;</p>
<p>&#x5E7F;&#x4E49;&#x8868;&#x662F;&#x4E00;&#x4E2A;&#x9012;&#x5F52;&#x5B9A;&#x4E49;&#x7684;&#x7EBF;&#x6027;&#x7ED3;&#x6784;&#xFF0C;&#x56E0;&#x4E3A;&#x5728;&#x63CF;&#x8FF0;&#x5E7F;&#x4E49;&#x8868;&#x65F6;&#x53C8;&#x7528;&#x5230;&#x4E86;&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x6982;&#x5FF5;&#x3002;&#x4E00;&#x4E9B;&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x4F8B;&#x5B50;&#xFF1A;</p>
<ol>
<li><em>A = ( )</em> &#x2014;&#x2014; A &#x662F;&#x4E00;&#x4E2A;&#x7A7A;&#x8868;&#xFF0C;&#x4ED6;&#x7684;&#x957F;&#x5EA6;&#x4E3A;&#x96F6;&#x3002;</li>
<li><em>B = (e)</em> &#x2014;&#x2014;&#x5217;&#x8868; B &#x53EA;&#x6709;&#x4E00;&#x4E2A;&#x539F;&#x5B50; e&#xFF0C;B &#x7684;&#x957F;&#x5EA6;&#x4E3A; 1&#x3002;</li>
<li><em>C = (a,(b,c,d))</em> &#x2014;&#x2014;&#x5217;&#x8868; C &#x7684;&#x957F;&#x5EA6;&#x4E3A; 2&#xFF0C;&#x4E24;&#x4E2A;&#x5143;&#x7D20;&#x5206;&#x522B;&#x4E3A;&#x539F;&#x5B50; a &#x548C;&#x5B50;&#x8868; <em>(b,c,d)</em>&#x3002;</li>
<li><em>D = (A,B,C)</em> &#x2014;&#x2014;&#x5217;&#x8868; D &#x7684;&#x957F;&#x5EA6;&#x4E3A; 3&#xFF0C;3 &#x4E2A;&#x5143;&#x7D20;&#x90FD;&#x662F;&#x5217;&#x8868;&#x3002;</li>
<li><em>E = (a,E)</em> &#x2014;&#x2014;&#x8FD9;&#x662F;&#x4E00;&#x4E2A;&#x9012;&#x5F52;&#x7684;&#x8868;&#xFF0C;&#x4ED6;&#x7684;&#x957F;&#x5EA6;&#x4E3A; 2&#x3002;E &#x76F8;&#x5F53;&#x4E8E;&#x4E00;&#x4E2A;&#x65E0;&#x9650;&#x5217;&#x8868; <em>E = (a,(a,(a,&#xB7;&#xB7;&#xB7;)))</em>&#x3002;</li>
</ol>
<p>&#x5217;&#x8868;&#x7684;&#x7ED3;&#x6784;&#x7279;&#x70B9;&#xFF1A;</p>
<ol>
<li>&#x5E7F;&#x4E49;&#x8868;&#x4E2D;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;&#x6709;&#x76F8;&#x5BF9;&#x6B21;&#x5E8F;&#xFF1B;</li>
<li>&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x957F;&#x5EA6;&#x5B9A;&#x4E49;&#x4E3A;&#x6700;&#x5916;&#x5C42;&#x5305;&#x542B;&#x7684;&#x5143;&#x7D20;&#x4E2A;&#x6570;&#xFF1B;</li>
<li>&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x6DF1;&#x5EA6;&#x5B9A;&#x4E49;&#x4E3A;&#x6240;&#x542B;&#x62EC;&#x5F27;&#x7684;&#x91CD;&#x6570;&#xFF1B;<ul>
<li>&#x201C;&#x7A7A;&#x8868;&#x201D;&#x7684;&#x6DF1;&#x5EA6;&#x4E3A; 1&#xFF0C;&#x957F;&#x5EA6;&#x4E3A; 0&#x3002;<em>C = (a,(b,(c,d)))</em> &#x7684;&#x957F;&#x5EA6;&#x662F; 2&#xFF0C;&#x4E24;&#x4E2A;&#x5143;&#x7D20;&#x5206;&#x522B;&#x662F;&#x539F;&#x5B50; <em>a</em> &#x548C;&#x5B50;&#x8868; <em>(b,(c,d))</em>&#xFF0C;&#x6DF1;&#x5EA6;&#x662F;3</li>
</ul>
</li>
<li>&#x5E7F;&#x4E49;&#x8868;&#x53EF;&#x4EE5;&#x5171;&#x4EAB;&#xFF1B;<ul>
<li>&#x5982;&#x4E0A;&#x8FF0;&#x4F8B;&#x5B50;&#x4E2D;&#x5217;&#x8868; A&#x3001;B &#x548C; C &#x662F; D &#x7684;&#x5B50;&#x8868;</li>
</ul>
</li>
<li>&#x5E7F;&#x4E49;&#x8868;&#x53EF;&#x4EE5;&#x662F;&#x4E00;&#x4E2A;&#x9012;&#x5F52;&#x7684;&#x8868;&#xFF1B;&#x9012;&#x5F52;&#x8868;&#x7684;&#x6DF1;&#x5EA6;&#x662F;&#x65E0;&#x7A77;&#x503C;&#xFF0C;&#x957F;&#x5EA6;&#x662F;&#x6709;&#x9650;&#x503C;&#x3002;</li>
</ol>
<blockquote>
<p>&#x4EFB;&#x4F55;&#x4E00;&#x4E2A;&#x975E;&#x7A7A;&#x5217;&#x8868;&#x5176;&#x8868;&#x5934;&#x53EF;&#x80FD;&#x662F;&#x539F;&#x5B50;&#xFF0C;&#x4E5F;&#x53EF;&#x80FD;&#x662F;&#x5217;&#x8868;&#xFF0C;&#x5176;&#x8868;&#x5C3E;&#x4E00;&#x5B9A;&#x662F;&#x5217;&#x8868;&#x3002;&#x5217;&#x8868; <em>()</em> &#x548C; <em>(())</em> &#x4E0D;&#x540C;&#xFF0C;&#x524D;&#x8005;&#x4E3A;&#x7A7A;&#x8868;&#xFF0C;&#x957F;&#x5EA6;&#x4E3A; 0&#xFF0C;&#x800C;&#x540E;&#x8005;&#x957F;&#x5EA6;&#x4E3A; 1&#xFF0C;&#x53EF;&#x5206;&#x89E3;&#x5F97;&#x5230;&#x5176;&#x8868;&#x5934;&#x3001;&#x8868;&#x5C3E;&#x5747;&#x4E3A;&#x7A7A;&#x8868;&#x3002;</p>
</blockquote>
<h2 id="&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;">&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;</h2>
<p>&#x7531;&#x4E8E;&#x5E7F;&#x4E49;&#x8868;&#x662F;&#x9012;&#x5F52;&#x5B9A;&#x4E49;&#x7684;&#xFF0C;&#x5176;&#x4E2D;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;&#x53EF;&#x4EE5;&#x5177;&#x6709;&#x4E0D;&#x540C;&#x7684;&#x7ED3;&#x6784;&#xFF0C;&#x6545;&#x5E38;&#x91C7;&#x7528;&#x94FE;&#x5F0F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#xFF0C;&#x6BCF;&#x4E2A;&#x6570;&#x636E;&#x5143;&#x7D20;&#x7528;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#x8868;&#x793A;&#x3002;</p>
<p>&#x7531;&#x4E8E;&#x5217;&#x8868;&#x4E2D;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;&#x53EF;&#x80FD;&#x4E3A;&#x539F;&#x5B50;&#x6216;&#x5217;&#x8868;&#xFF0C;&#x56E0;&#x6B64;&#x9700;&#x8981;&#x4E24;&#x79CD;&#x7ED3;&#x6784;&#x7684;&#x7ED3;&#x70B9;&#xFF1A;</p>
<ul>
<li><strong>&#x8868;&#x7ED3;&#x70B9;</strong>&#xFF0C;&#x7528;&#x4EE5;&#x8868;&#x793A;&#x5217;&#x8868;</li>
<li><strong>&#x539F;&#x5B50;&#x7ED3;&#x70B9;</strong>&#xFF0C;&#x7528;&#x4EE5;&#x8868;&#x793A;&#x539F;&#x5B50;</li>
</ul>
<p>&#x5217;&#x8868;&#x4E0D;&#x4E3A;&#x7A7A;&#xFF0C;&#x5219;&#x53EF;&#x5206;&#x89E3;&#x6210;&#x8868;&#x5934;&#x548C;&#x8868;&#x5C3E;&#xFF0C;&#x53CD;&#x4E4B;&#xFF0C;&#x4E00;&#x5BF9;&#x786E;&#x5B9A;&#x7684;&#x8868;&#x5934;&#x548C;&#x8868;&#x5C3E;&#x53EF;&#x552F;&#x4E00;&#x786E;&#x5B9A;&#x5217;&#x8868;&#x3002;</p>
<ul>
<li>&#x4E00;&#x4E2A;&#x8868;&#x7ED3;&#x70B9;&#x53EF;&#x7531; 3 &#x4E2A;&#x57DF;&#x7EC4;&#x6210;&#xFF1A;&#x6807;&#x5FD7;&#x57DF;&#x3001;&#x6307;&#x793A;&#x8868;&#x5934;&#x7684;&#x6307;&#x9488;&#x57DF;&#x548C;&#x6307;&#x793A;&#x8868;&#x5C3E;&#x7684;&#x6307;&#x9488;&#x57DF;&#x3002;</li>
<li>&#x539F;&#x5B50;&#x7ED3;&#x70B9;&#x5177;&#x6709;&#x4E24;&#x4E2A;&#x57DF;&#xFF1A;&#x6807;&#x5FD7;&#x57DF;&#x3001;&#x503C;&#x57DF;&#x3002;</li>
</ul>
<p>&#x5E7F;&#x4E49;&#x8868;&#x7684;&#x5934;&#x5C3E;&#x94FE;&#x8868;&#x5B58;&#x50A8;&#x8868;&#x793A;&#xFF1A;</p>
<pre><code class="lang-C"><span class="hljs-comment">/**
 * &#x7ED3;&#x70B9;&#x6807;&#x5FD7;&#x679A;&#x4E3E;
 * ATOM &#x539F;&#x5B50;
 * LIST &#x5B50;&#x8868;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">enum</span>
{
    ATOM, LIST
}ElemTag;

<span class="hljs-comment">/**
 * &#x5E7F;&#x4E49;&#x8868;&#x6570;&#x636E;&#x5143;&#x7D20;&#x7ED3;&#x70B9;&#x7ED3;&#x6784;&#x5B9A;&#x4E49;
 */</span>
 <span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> GLNode
{
    ElemTag tag; <span class="hljs-comment">// &#x533A;&#x5206;&#x539F;&#x5B50;&#x7ED3;&#x70B9;&#x548C;&#x5B50;&#x8868;&#x7ED3;&#x70B9;</span>
    <span class="hljs-keyword">union</span> <span class="hljs-comment">// &#x539F;&#x5B50;&#x7ED3;&#x70B9;&#x548C;&#x8868;&#x7ED3;&#x70B9;&#x7684;&#x8054;&#x5408;&#x90E8;&#x5206;</span>
    {
        AtomType atom; <span class="hljs-comment">// atom &#x662F;&#x539F;&#x5B50;&#x7ED3;&#x70B9;&#x7684;&#x503C;&#x57DF;</span>
        <span class="hljs-keyword">struct</span>
        {  
            <span class="hljs-keyword">struct</span> GLNode *hp, *tp;
        }ptr; <span class="hljs-comment">// ptr &#x662F;&#x5B50;&#x8868;&#x7ED3;&#x70B9;&#x7684;&#x6307;&#x9488;&#x57DF;</span>
    };
 }*GList, GLNode;
</code></pre>

                                
                                </section>
                            
    </div>
    <div class="search-results">
        <div class="has-results">
            
            <h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
            <ul class="search-results-list"></ul>
            
        </div>
        <div class="no-results">
            
            <h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
            
        </div>
    </div>
</div>

                        </div>
                    </div>
                
            </div>

            
                
                <a href="矩阵的压缩存储.html" class="navigation navigation-prev navigation-unique" aria-label="Previous page: 矩阵的压缩存储">
                    <i class="fa fa-angle-left"></i>
                </a>
                
                
            
        
    </div>

    <script>
        var gitbook = gitbook || [];
        gitbook.push(function() {
            gitbook.page.hasChanged({"page":{"title":"广义表","level":"1.6.3","depth":2,"next":{"title":"第六章 树和二叉树","level":"1.7","depth":1,"ref":"","articles":[{"title":"树的定义与基本术语","level":"1.7.1","depth":2,"path":"chapter6/树.md","ref":"chapter6/树.md","articles":[]},{"title":"二叉树","level":"1.7.2","depth":2,"path":"chapter6/二叉树.md","ref":"chapter6/二叉树.md","articles":[{"title":"二叉树的二叉链表实现","level":"1.7.2.1","depth":3,"path":"chapter6/二叉树的二叉链表实现.md","ref":"chapter6/二叉树的二叉链表实现.md","articles":[]}]},{"title":"遍历二叉树和线索二叉树","level":"1.7.3","depth":2,"path":"chapter6/遍历二叉树和线索二叉树.md","ref":"chapter6/遍历二叉树和线索二叉树.md","articles":[]},{"title":"树和森林","level":"1.7.4","depth":2,"path":"chapter6/树和森林.md","ref":"chapter6/树和森林.md","articles":[]},{"title":"赫夫曼树","level":"1.7.5","depth":2,"path":"chapter6/赫夫曼树.md","ref":"chapter6/赫夫曼树.md","articles":[]}]},"previous":{"title":"矩阵的压缩存储","level":"1.6.2","depth":2,"path":"chapter5/矩阵的压缩存储.md","ref":"chapter5/矩阵的压缩存储.md","articles":[]},"dir":"ltr"},"config":{"gitbook":"*","theme":"default","variables":{},"plugins":[],"pluginsConfig":{"highlight":{},"search":{},"lunr":{"maxIndexSize":1000000,"ignoreSpecialCharacters":false},"sharing":{"facebook":true,"twitter":true,"google":false,"weibo":false,"instapaper":false,"vk":false,"all":["facebook","google","twitter","weibo","instapaper"]},"fontsettings":{"theme":"white","family":"sans","size":2},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"}},"file":{"path":"chapter5/广义表.md","mtime":"2018-08-20T13:51:44.913Z","type":"markdown"},"gitbook":{"version":"3.2.3","time":"2018-09-02T10:05:33.540Z"},"basePath":"..","book":{"language":""}});
        });
    </script>
</div>

        
    <script src="../gitbook/gitbook.js"></script>
    <script src="../gitbook/theme.js"></script>
    
        
        <script src="../gitbook/gitbook-plugin-search/search-engine.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-search/search.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/lunr.min.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/search-lunr.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-sharing/buttons.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
        
    

    </body>
</html>

